package Top200;

/**
 * @author zhangmin
 * @create 2022-02-24 16:38
 */
public class climbStairs70 {
    public int climbStairs(int n) {
        if (n<=2) return n;
        int[] dp=new int[n+1];
        dp[1]=1;dp[2]=2;
        for (int i = 3; i <= n; i++) {
            dp[i]=dp[i-1]+dp[i-2];
        }
        return dp[n];
    }
}
